Review Of Fast Multiplication Algorithms For Embedded Systems Design
نویسندگان
چکیده
This paper presents a review with numerical example and complexity analysis of the fast multiplication algorithms to help embedded system designers to improve the hardware performance for many applications such as cryptosystems design. The paper presented two practical multiplication algorithms: Karatsuba multiplication algorithm with time complexity O(n ) and Schönhage–Strassen multiplication algorithm with the run-time bit complexity defined as O(n (n) ( (n)) . In addition, interleaved multiplication algorithm can be used efficiently to compute the modular multiplication with logarithmic time complexity which enhances the linear time complexity of Montgomery modular multiplication.
منابع مشابه
A SURVEY OF CHAOS EMBEDDED META-HEURISTIC ALGORITHMS
This article presents a comprehensive review of chaos embedded meta-heuristic optimization algorithms and describes the evolution of this algorithms along with some improvements, their combination with various methods as well as their applications. The reported results indicate that chaos embedded algorithms may handle engineering design problems efficiently in terms of precision and convergenc...
متن کاملAppendix A: A functional programming approach to hardware acceleration of algorithms
The aim of this proposal is to develop methods and tools to enable large scale acceleration of algorithms using reconfigurable hardware (Field Programmable Gate Arrays, FPGAs). FPGAs currently contain resources other than just a fabric of computing elements; examples include fast carry chains, embedded DSP circuits that run much faster than the reconfigurable fabric, and embedded processors. Th...
متن کاملTrade-offs of certified fixed-point code synthesis for linear algebra basic blocks
In embedded systems, efficient implementations of numerical algorithms typically use the fixed-point arithmetic rather than the standardized and costly floating-point arithmetic. But, fixed-point programmers face two difficulties: First, writing fixed-point codes is tedious and error prone. Second, the low dynamic range of fixed-point numbers leads to the persistent belief that fixedpoint compu...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملFast software multiplication in F2[x] for embedded processors
We present a novel method for fast multiplication of polynomials over 2 which can be implemented efficiently in embedded software. Fast polynomial multiplication methods are needed for the efficient implementation of some cryptographic and coding applications. The proposed method follows a strategy to reduce the memory accesses for input data and intermediate values during computation. This str...
متن کامل